Relaxed Modulus-Based Matrix Splitting Methods for the Linear Complementarity Problem
نویسندگان
چکیده
منابع مشابه
Convergence analysis of modulus-based matrix splitting iterative methods for implicit complementarity problems
In this paper, we demonstrate a complete version of the convergence theory of the modulus-based matrix splitting iteration methods for solving a class of implicit complementarity problems proposed by Hong and Li (Numer. Linear Algebra Appl. 23:629-641, 2016). New convergence conditions are presented when the system matrix is a positive-definite matrix and an [Formula: see text]-matrix, respecti...
متن کاملModulus-based synchronous multisplitting iteration methods for linear complementarity problems
To reduce the communication among processors and improve the computing time for solving linear complementarity problems, we present a two-step modulus-based synchronous multisplitting iteration method and the corresponding symmetric modulus-based multisplitting relaxation methods. The convergence theorems are established when the system matrix is an H+-matrix, which improve the existing converg...
متن کاملOn Smoothing Methods for the P0 Matrix Linear Complementarity Problem
In this paper, we propose a Big-? smoothing method for solving the P 0 matrix linear complementarity problem. We study the trajectory deened by the augmented smoothing equations and global convergence of the method under an assumption that the original P 0 matrix linear complementarity problem has a solution. The method has been tested on the P 0 matrix linear complementarity problem with unbou...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملOn the modulus algorithm for the linear complementarity problem
or to conclude that no such vectors ω, z exist. The inequalities appearing in (1) and in the sequel are understood componentwise and o denotes the zero vector. Many applications and solution methods for (1) can be found in [3] and [4], respectively. In [8] (see also Section 9.2 in [4]), the so-called modulus algorithm was developed for solving the LCP: Let I denote the identity and with x ∈ R w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2021
ISSN: 2073-8994
DOI: 10.3390/sym13030503